Divergence-Preserving Branching Bisimilarity
نویسندگان
چکیده
منابع مشابه
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence
We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of 0, action prefix, choice, and the recursion construct μX. .
متن کاملBranching Bisimilarity with Explicit Divergence
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with untiland divergence modalities.
متن کاملProperty-dependent reductions adequate with divergence-sensitive branching bisimilarity
Article history: Received 29 March 2013 Received in revised form 28 March 2014 Accepted 7 April 2014 Available online 18 April 2014
متن کاملBranching Bisimilarity Checking for PRS
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any other models in the hierarchy of PRS (Process Rewrite Systems) whose branching bisimilarity is decidable. It is shown in this paper that the branching bisimilarity for both nOCN (normed One Co...
متن کاملIs Timed Branching Bisimilarity an Equivalence Indeed?
We show that timed branching bisimilarity as defined by van der Zwaag [14] and Baeten & Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, van der Zwaag’s defini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2020
ISSN: 2075-2180
DOI: 10.4204/eptcs.322.2